Call Stack
int fact(int n)
{
if (n==1)
return 1;
else
return n * fact(n - 1);
}
int main(void)
{
printf("%i\n", fact(5));
}
This recursive function would look like this in Stack Memory
// a lot of call stack, which will release as the function done one by one from the top one.
fact(1)
fact(2)
fact(3)
fact(4)
fact(5)
printf()
main()
